The Downward Refinement Property
نویسندگان
چکیده
Using abstraction in planning does not guarantee an im provement in search efficiency; it is possible for an abstract planner to display worse performance than one that does not use abstraction. Analysis and experiments have shown that good abstraction hierarchies have, or are close to having, the downward refinement property, whereby, given that a concrete-level solution exists, every abstract solution can be refined to a concrete-level solu tion without backtracking across abstract levels. Work ing within a semantics for ABSTRIPS-style abstraction we provide a characterization of the downward refinement property. After discussing its effect on search efficiency, we develop a semantic condition sufficient for guarantee ing its presence in an abstraction hierarchy. Using the semantic condition, we then provide a set of sufficient and polynomial-time checkable syntactic conditions that can be used for checking a hierarchy for the downward refinement property,
منابع مشابه
A General Completeness Result in Refinement
In a paper in 1986, Hoare, He and Sanders proposed a formulation of refinement for a system equivalent to the ν-calculus using a relation based semantics. To give a proof method to show that one program is a refinement of another, they introduced downward simulation and upward simulation, but the proof method based upon either of them is not complete with respect to their notion of refinement, ...
متن کاملA Single Complete Relational Rule for Coalgebraic Refinement
A transition system can be presented either as a binary relation or as a coalgebra for the powerset functor, each representation being obtained from the other by transposition. More generally, a coalgebra for a functor F generalises transition systems in the sense that a shape for transitions is determined by F, typically encoding a signature of methods and observers. This paper explores such a...
متن کاملStratified Case-Based Reasoning in Non-Refinable Abstraction Hierarchies
Stratified case-based reasoning (ScBR) is a technique ̄ in which case abstractions are used to assist case retrieval, matching, and adaptation. Previous work showed that SCBR can significantly decrease the computational expense required for retrieval, matching, and adaptation in a route-finding domain characterized by abstraction hierarchies with the downward refinement property. This work explo...
متن کاملEffect of Pre-existing Nano Sized Precipitates on Microstructure and Mechanical Property of Al-0.2wt% Sc Highly Deformed by ARB Process
The effect of pre-existing nano sized precipitates on the mechanisms and rate of grain refinement has been investigated during the severe plastic deformation. A binary Al–0.2Sc alloy, containing coherent Al3Sc particles, of 3.62 nm in diameter has been deformed by accumulative roll bonding up to 10 cycles. The resulting deformed structures were quantitatively analyzed using electron backscatter...
متن کاملNon-atomic Refinement in Z and CSP
In this paper we discuss the relationship between notions of non-atomic (or action) refinement in a state-based setting with that in a behavioural setting. In particular, we show that the definition of non-atomic coupled downward simulation as defined for Z and Object-Z is sound with respect to an action refinement definition of CSP failures refinement.
متن کامل